Approximating the smallest k -edge connected spanning subgraph by LP-rounding
نویسندگان
چکیده
منابع مشابه
Approximating the smallest k-edge connected spanning subgraph by LP-rounding
The smallest k -ECSS problem is, given a graph along with an integer k , find a spanning subgraph that is k -edge connected and contains the fewest possible number of edges. We examine a natural approximation algorithm based on rounding an LP solution. A tight bound on the approximation ratio is 1+3/k for undirected graphs with k > 1 odd, 1+2/k for undirected graphs with k even, and 1+2/k for d...
متن کاملApproximating the Smallest 2-Vertex Connected Spanning Subgraph of a Directed Graph
We consider the problem of approximating the smallest 2vertex connected spanning subgraph (2-VCSS) of a 2-vertex connected directed graph, and explore the efficiency of fast heuristics. First, we present a linear-time heuristic that gives a 3-approximation of the smallest 2-VCSS. Then we show that this heuristic can be combined with an algorithm of Cheriyan and Thurimella that achieves a (1 + 1...
متن کاملApproximating the Smallest 2-Vertex-Connected Spanning Subgraph via Low-High Orders
Let G = (V,E) be a 2-vertex-connected directed graph with m edges and n vertices. We consider the problem of approximating the smallest 2-vertex connected spanning subgraph (2VCSS) of G, and provide new efficient algorithms for this problem based on a clever use of low-high orders. The best previously known algorithms were able to compute a 3/2-approximation in O(m √ n+n2) time, or a 3-approxim...
متن کاملApproximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs
Let G be a strongly connected directed graph. We consider the following three problems, where we wish to compute the smallest strongly connected spanning subgraph of G that maintains respectively: the 2-edge-connected blocks of G (2EC-B); the 2-edge-connected components of G (2EC-C); both the 2-edge-connected blocks and the 2edge-connected components of G (2EC-B-C). All three problems are NPhar...
متن کاملImproving on the 1.5-Approximation of a Smallest 2-Edge Connected Spanning Subgraph
We give a 17 12-approximation algorithm for the following NP-hard problem: Given a simple undirected graph, nd a 2-edge connected spanning subgraph that has the minimum number of edges. The best previous approximation guarantee was 3 2. If the well known 4 3 conjecture for the metric TSP holds, then the optimal value (minimum number of edges) is at most 4 3 times the optimal value of a linear p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Networks
سال: 2008
ISSN: 0028-3045
DOI: 10.1002/net.20289